Complexity of the min–max (regret) versions of min cut problems
نویسندگان
چکیده
منابع مشابه
Complexity of the Min-Max (Regret) Versions of Cut Problems
This paper investigates the complexity of the min-max and min-max regret versions of the s− t min cut and min cut problems. Even if the underlying problems are closely related and both polynomial, we show that the complexity of their min-max and min-max regret versions, for a constant number of scenarios, are quite contrasted since they are respectively strongly NP-hard and polynomial. Thus, we...
متن کاملComplexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and both polynomial, the complexity of their min-max and min-max regret versions, for a constant number of scenarios, is quite contrasted since they are respectively strongly NP hard and polynomial. However, for a non cons...
متن کاملApproximating Min-Max (Regret) Versions of Some Polynomial Problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies about their approximation. For a bounded number of scenarios, we establish a general approximation scheme which can be used for min-max and min-max regret versions of some polynomial problems. Applying this scheme to short...
متن کاملApproximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملMin-max and min-max regret versions of combinatorial optimization problems: A survey
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t cut, knapsack. Since most of these problems are NP -hard, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2008
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2007.11.008